Accuracy Certificates for Computational Problems with Convex Structure
نویسندگان
چکیده
منابع مشابه
Accuracy Certificates for Computational Problems with Convex Structure
The goal of this paper is to introduce the notion of certificates, which verify the accuracy of solutions of computational problems with convex structure. Such problems include minimizing convex functions, variational inequalities with monotone operators, computing saddle points of convex-concave functions, and solving convex Nash equilibrium problems. We demonstrate how the implementation of t...
متن کاملApproximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The problem has a series-parallel structure, with the variables divided serially into n disjoint subsets, whose elements are considered in parallel. This special structure is exploited in two algorithms proposed here for the a...
متن کاملComputational Algorithm for Some Problems with Variable Geometrical Structure
The work is devoted to the computational algorithm for a problem of plant growth. The plant is represented as a system of connected intervals corresponding to branches. We compute the concentration distributions inside the branches. The originality of the problem is that the geometry of the plant is not a priori given. It evolves in time depending on the concentrations of plant hormones found a...
متن کاملOptimality certificates for convex minimization and Helly numbers
We consider the problem of minimizing a convex function over a subset of R that is not necessarily convex (minimization of a convex function over the integer points in a polytope is a special case). We define a family of duals for this problem and show that, under some natural conditions, strong duality holds for a dual problem in this family that is more restrictive than previously considered ...
متن کاملComputational Experience with a Primal-dual Interior Point Method for Smooth Convex Placement Problems
We present a primal-dual interior point method (IPM) for solving smooth convex optimization problems which arise during the placement of integrated circuits. The interior point method represents a substantial enhancement in flexibility verses other methods while having similar computational requirements. We illustrate that iterative solvers are efficient for calculation of search directions dur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2010
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1090.0427